On the Dynamics of EAs without Selection
نویسنده
چکیده
This paper investigates the dynamics of evolutionary algorithms (EAs) without tness based selection (constant tness). Such algorithms exhibit a behavior similar to the MISR eeect (mutation-induced speciation by recombination) which has been found in the analysis of (== D ;) evolution strategies. It will be shown that this behavior can be observed in a variety of EAs, not only in unrestricted search spaces, but also in binary GAs. The quantiication of this eeect is done by introducing the expected population variance 2 P. The evolution of 2 P over the time g is analytically calculated for both unrestricted and binary search spaces. The theoretical predictions are compared with experiments. The genetic drift phenomenon and the diiusion eeect are derived from the general 2 P formulae, and it will be shown that MISR is a nite population size sampling eeect which cannot be observed in innnite populations.
منابع مشابه
Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Utility of Populations
Evolutionary algorithms (EAs) are population-based search heuristics often used for function optimization. Typically they use selection, mutation, and crossover as search operators. On many test functions EAs are outperformed by simple hillclimbers. Therefore, it is investigated whether the use of a population and crossover is at all advantageous. In this paper it is rigorously proven that the ...
متن کاملNovel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection
In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...
متن کاملDrift analysis and average time complexity of evolutionary algorithms
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including conditions under which an EA will take no more than polynomial time (in problem size) to solve a prob...
متن کاملA System Dynamics Model for Joint Upstream and Downstream Partner Selection in a Supply Chain Consisting of Suppliers and Retailers
Firms no longer compete as autonomous entities and prefer to join in a supply chain alliance to take advantage of highly competitive business situation. Supply chain coordination has a great impact on strategic partnering and success of a firm in competitive business environment. In this paper, we propose a system dynamics simulation model for strategic partner selection in supply chain. Our mo...
متن کاملA System Dynamics model for joint upstream and downstream partner selection in a supply chain consisting of suppliers and retailers
Abstract Firms no longer compete as autonomous entities and prefer to joinin a supply chain alliance to take advantage of highly competitive business situation. Supply chain coordination has a greatimpact on Firm’sstrategic partnering and success in competitive business environment. In this paper, we propose a system dynamics simulation model for strategic partner selection in supply chai...
متن کامل